Wreath Decompositions of Finite Permutation Groups

There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding 'imprimitive wreath decomposition concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The result may be heuristically expressed as follows, exploiting the associative nature of the construction. Each finite transitive permutation group may be written, essentially uniquely, as the wreath product of a sequence of wreath-indecomposable groups, and the two-factor wreath decompositions of the group are precisely those which one obtains by bracketing this many-factor decomposition. If both input groups are nontrivial, the output above is always imprimilive. A similar construction gives a primitive output, called the wreath product in product action, provided the first input group is primitive and not regular. The second subject of the paper is the 'product action wreath decomposition' concept dual to this. An analogue of the result stated above is established for primitive groups with nonabelian socle. Given a primitive subgroup G with non-regular socle in some symmetric group S, how many subgroups W of S which contain G and have the same socle, are wreath products in product action? The third part of the paper outlines an algorithm which reduces this count to questions about permutation groups whose degrees are very much smaller than that of G.